GENSYNTH: Synthesizing Datalog Programs without Language Bias

نویسندگان

چکیده

Techniques for learning logic programs from data typically rely on language bias mechanisms to restrict the hypothesis space. These methods are therefore limited by user's ability tune them such that space is simultaneously large enough include target program but small admit a tractable search. We propose technique learn Datalog input-output examples without requiring user specify any bias. It employs an evolutionary search strategy mutates candidate and evaluates their fitness using off-the-shelf interpreter. have implemented our approach in tool called GenSynth evaluate it diverse tasks knowledge discovery, analysis, relational queries. Our experiments show can correct few examples, including require recursion invented predicates, robust noise.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refinement of Datalog Programs

Refinement operators are exploited to change in an automated way incorrect clauses of a logic program. In this paper, we present four refinement operators for Datalog programs and demonstrate that all of them meet the properties of local finiteness, properness, and completeness (ideality). Such operators are based on the quasi-ordering induced upon a set of clauses by the generalization model o...

متن کامل

Linearisability on datalog programs

LinearDatalog programs are programs whose clauses have at most one intensional atom in their bodies We explore syntactic classes of Datalog programs syntactically non linear which turn out to express no more than the queries expressed by linear Datalog programs In particular we investigate linearisability of database queries corresponding to piecewise linear Datalog programs and chain queries a...

متن کامل

Efficiently Computable Datalog∃ Programs

Datalog∃ is the extension of Datalog, allowing existentially quantified variables in rule heads. This language is highly expressive and enables easy and powerful knowledge-modeling, but the presence of existentially quantified variables makes reasoning over Datalog∃ undecidable, in the general case. The results in this paper enable powerful, yet decidable and efficient reasoning (query answerin...

متن کامل

Synthesizing Functional Reactive Programs

We present the first method to synthesize functional reactive programs from temporal logic specifications. Existing algorithms for the synthesis of reactive systems target finite-state implementations, such as hardware circuits, but fail when it comes to complex data transformations. Reactive programs instead provide a promising alternative to overcome this obstacle. They allow for abstraction ...

متن کامل

Synthesizing Reactive Programs

Current theoretical solutions to the classical Church’s synthesis problem are focused on synthesizing transition systems and not programs. Programs are compact and often the true aim in many synthesis problems, while the transition systems that correspond to them are often large and not very useful as synthesized artefacts. Consequently, current practical techniques first synthesize a transitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i7.16799